Image Computation in Infinite State Model Checking
نویسندگان
چکیده
The model checking of a counters system S often reduces to the effective computation of the set of predecessors Pre∗S(X) of a set of integer vectors X. Because the exact computation of this set is not possible in general, we are interested in characterizing the minimal Number Decision Diagrams (NDD) [WB00] that represents the set Pre(X). In particular, its size is proved to be just polynomially bounded in k when S is a counters system with a finite monöıd [FL02], explaining why there is no exponential blow up in k.
منابع مشابه
Model Checking of Infinite State Space Markov Chains by Stochastic Bounds
In this paper, we discuss how to check Probablistic Computation Tree Logic (PCTL) logic operators over infinite state Discrete Time Markov Chains (DTMC). Probabilistic model checking has been largely applied over finite state space Markov models. Recently infinite state models have been considered when underlying infinite Markov models have special structures. We propose to consider finite stat...
متن کاملModel Checking of Consensus Algorithms
We show for the first time that standard model checking allows one to completely verify asynchronous algorithms for solving consensus, a fundamental problem in fault-tolerant distributed computing. Model checking is a powerful verification methodology based on state exploration. However it has rarely been applied to consensus algorithms, because these algorithms induce huge, often infinite stat...
متن کاملAutomatic verification of timed concurrent constraint programs
The language Timed Concurrent Constraint (tccp) is the extension over time of the Concurrent Constraint Programming (cc) paradigm that allows us to specify concurrent systems where timing is critical, for example reactive systems. Systems which may have an infinite number of states can be specified in tccp. Model checking is a technique which is able to verify finite-state systems with a huge n...
متن کاملA new algorithm for Partitioned Model Checking
State space partitioning-based approaches have been proposed in the literature to address the state-space explosion problem in model checking. These approaches, whether sequential or distributed, perform a large amount of work in the form of inter-partition (cross-over) image computations, which can be expensive. We present a model checking algorithm that aggregates these expensive cross-over i...
متن کاملSpecification of an Infinite-State Local Model Checker in Rewriting Logic
We formalize a local model checker in rewriting logic and use it to analyze an infinite-state system in this paper. In order not to pursue infinite computation path endlessly, we perform bounded proof search on the system. Inconclusive proofs occurred in the bounded search are formalized by introducing three-valued logic in our local model checker. We therefore demonstrate how to use rewriting ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004